Iterative substructuring methods for spectral elements: Problems in three dimensions based on numerical quadrature
نویسندگان
چکیده
منابع مشابه
An Iterative Substructuring Algorithm for Problems in Three Dimensions
In domain decomposition algorithms with more than a few subdomains, there is a crucial need for a mechanism to provide for global communication of information at each step of the iterative process. The convergence rate will decay rapidly with an increasing number of subdomains if communication is only between neighboring subdomains. For iterative substructuring algorithms (those domain decompos...
متن کاملOn Iterative Substructuring Methods for Multiscale Problems
In this note, we discuss iterative substructuring methods for a scalar elliptic model problem with a strongly varying diffusion coefficient that is typically discontinuous and exhibits large jumps. Opposed to earlier theory, we treat the case where the jumps happen on a small spatial scale and can in general not be resolved by a domain decomposition. We review the available theory of FETI metho...
متن کاملA Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions
Numerical results from a parallel implementation of an iterative substructuring algorithm are reported. The algorithm is for solving scalar, self-adjoint elliptic partial diierential equations in three dimensions. Results are given for two variants of the algorithm. In the rst variant, exact interior solvers are used; in the second, one multigrid V-cycle is used to approximately solve the inter...
متن کاملOn the Origins of Iterative Substructuring Methods
Substructuring methods were invented in the engineering community. A very early precursor is the so called " Moment Distribution Method " , or " Hardy Cross Method " named after its inventor [11]. Cross states in the introduction to his paper from 1930 his motivation for the method: The reactions in beams, bents, and arches which are immovably fixed at their ends have been extensively discussed...
متن کاملSubstructuring Methods for Parabolic Problems
Domain decomposition methods without overlapping for the approximation of parabolic problems are considered. Two kinds of methods are discussed. In the rst method systems of algebraic equations resulting from the approximation on each time level are solved iteratively with a Neumann-Dirichlet preconditioner. The second method is direct and similar to certain iterative methods with a Neumann-Neu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1997
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(96)00230-1